0.09/0.14	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.16	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.16/0.38	% Computer   : n029.cluster.edu
0.16/0.38	% Model      : x86_64 x86_64
0.16/0.38	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.16/0.38	% Memory     : 8042.1875MB
0.16/0.38	% OS         : Linux 3.10.0-693.el7.x86_64
0.16/0.38	% CPULimit   : 1200
0.16/0.38	% WCLimit    : 120
0.16/0.38	% DateTime   : Tue Jul 13 15:27:55 EDT 2021
0.16/0.38	% CPUTime    : 
0.16/0.38	% Number of cores: 8
0.16/0.38	% Python version: Python 3.6.8
0.16/0.38	# Version: 2.6rc1-ho
0.16/0.39	# No SInE strategy applied
0.16/0.39	# Trying AutoSched0 for 59 seconds
0.46/0.69	# AutoSched0-Mode selected heuristic SAT001_MinMin_x000000_rr
0.46/0.69	# and selection function SelectMaxLComplexAvoidPosPred.
0.46/0.69	#
0.46/0.69	# Preprocessing time       : 0.299 s
0.46/0.69	# Presaturation interreduction done
0.46/0.69	
0.46/0.69	# Proof found!
0.46/0.69	# SZS status Theorem
0.46/0.69	# SZS output start CNFRefutation
0.46/0.69	thf(ax2, axiom, ![X36:$o]:(X36<=c_not @ (c_not @ (X36))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax2)).
0.46/0.69	thf(ax13, axiom, (c_not)=(^[X81:$o]:(X81=>c_False)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax13)).
0.46/0.69	thf(ax5, axiom, c_not @ (?[X1:$i]:c_In @ X1 @ c_Empty), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax5)).
0.46/0.69	thf(conj, conjecture, ![X1:$i]:(![X2:$i]:(c_In @ X2 @ X1=>![X3:$i]:(?[X110:$i]:![X6:$i]:((c_and @ (c_exactly2 @ X110) @ (c_not @ (c_exactly5 @ X6))<=c_ordinal @ X110)=>(((c_atleast2 @ X110=>(c_and @ (c_atleast5 @ X3) @ (c_not @ (c_exactly1of2 @ (c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)) @ (c_TransSet @ X6)))<=((c_not @ (c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))=>(X110)=(X6))=>c_atleast3 @ X110)))<=(c_ordinal @ X110=>c_exactly2 @ X110))=>c_nat_p @ X110))<=c_In @ X3 @ X2))<=c_In @ X1 @ c_Empty), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj)).
0.46/0.69	thf(c_0_4, plain, ![X36:$o]:(((((~X36|~c_not @ $true)&(X36|~c_not @ $false))|c_not @ $true)&(((~X36|c_not @ $true)&(X36|c_not @ $false))|c_not @ $false))=>X36), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax2])])).
0.46/0.69	thf(c_0_5, plain, ![X81:$o]:(c_not @ X81<=>(X81=>c_False)), inference(fof_simplification,[status(thm)],[ax13])).
0.46/0.69	thf(c_0_6, plain, ![X110:$i, X6:$i]:(epred113_2 @ X6 @ X110<=>((~c_exactly2 @ X110|((((~c_exactly5 @ X6|~c_not @ $true)&(c_exactly5 @ X6|~c_not @ $false))|c_and @ $true @ $true)&(((~c_exactly5 @ X6|c_not @ $true)&(c_exactly5 @ X6|c_not @ $false))|c_and @ $true @ $false)))&(c_exactly2 @ X110|((((~c_exactly5 @ X6|~c_not @ $true)&(c_exactly5 @ X6|~c_not @ $false))|c_and @ $false @ $true)&(((~c_exactly5 @ X6|c_not @ $true)&(c_exactly5 @ X6|c_not @ $false))|c_and @ $false @ $false))))), introduced(definition)).
0.46/0.69	thf(c_0_7, plain, ![X3:$i, X6:$i]:(epred114_2 @ X6 @ X3<=>((~c_atleast5 @ X3|((((((~c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|~c_exactly1of2 @ $true @ $true)&(c_TransSet @ X6|~c_exactly1of2 @ $true @ $false)))&(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|~c_exactly1of2 @ $false @ $true)&(c_TransSet @ X6|~c_exactly1of2 @ $false @ $false))))|~c_not @ $true)&(((~c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|c_exactly1of2 @ $true @ $true)&(c_TransSet @ X6|c_exactly1of2 @ $true @ $false)))&(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|c_exactly1of2 @ $false @ $true)&(c_TransSet @ X6|c_exactly1of2 @ $false @ $false))))|~c_not @ $false))|c_and @ $true @ $true)&(((((~c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|~c_exactly1of2 @ $true @ $true)&(c_TransSet @ X6|~c_exactly1of2 @ $true @ $false)))&(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|~c_exactly1of2 @ $false @ $true)&(c_TransSet @ X6|~c_exactly1of2 @ $false @ $false))))|c_not @ $true)&(((~c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|c_exactly1of2 @ $true @ $true)&(c_TransSet @ X6|c_exactly1of2 @ $true @ $false)))&(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|c_exactly1of2 @ $false @ $true)&(c_TransSet @ X6|c_exactly1of2 @ $false @ $false))))|c_not @ $false))|c_and @ $true @ $false)))&(c_atleast5 @ X3|((((((~c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|~c_exactly1of2 @ $true @ $true)&(c_TransSet @ X6|~c_exactly1of2 @ $true @ $false)))&(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|~c_exactly1of2 @ $false @ $true)&(c_TransSet @ X6|~c_exactly1of2 @ $false @ $false))))|~c_not @ $true)&(((~c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|c_exactly1of2 @ $true @ $true)&(c_TransSet @ X6|c_exactly1of2 @ $true @ $false)))&(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|c_exactly1of2 @ $false @ $true)&(c_TransSet @ X6|c_exactly1of2 @ $false @ $false))))|~c_not @ $false))|c_and @ $false @ $true)&(((((~c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|~c_exactly1of2 @ $true @ $true)&(c_TransSet @ X6|~c_exactly1of2 @ $true @ $false)))&(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|~c_exactly1of2 @ $false @ $true)&(c_TransSet @ X6|~c_exactly1of2 @ $false @ $false))))|c_not @ $true)&(((~c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|c_exactly1of2 @ $true @ $true)&(c_TransSet @ X6|c_exactly1of2 @ $true @ $false)))&(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty)|((~c_TransSet @ X6|c_exactly1of2 @ $false @ $true)&(c_TransSet @ X6|c_exactly1of2 @ $false @ $false))))|c_not @ $false))|c_and @ $false @ $false))))), introduced(definition)).
0.46/0.69	thf(c_0_8, axiom, ((~(?[X1:$i]:c_In @ X1 @ c_Empty)|c_not @ $true)&(?[X1:$i]:c_In @ X1 @ c_Empty|c_not @ $false)), inference(fool_unroll,[status(thm)],[ax5])).
0.46/0.69	thf(c_0_9, plain, ![X426:$o]:(((((((~X426|X426|(~X426|X426)|X426)&(~c_not @ $false|X426|(~X426|X426)|X426))&((~X426|~c_not @ $true|(~X426|X426)|X426)&(~c_not @ $false|~c_not @ $true|(~X426|X426)|X426)))&(~c_not @ $false|(~X426|X426)|X426))&((((~X426|X426|(c_not @ $false|X426)|X426)&(~c_not @ $false|X426|(c_not @ $false|X426)|X426))&((~X426|~c_not @ $true|(c_not @ $false|X426)|X426)&(~c_not @ $false|~c_not @ $true|(c_not @ $false|X426)|X426)))&(~c_not @ $false|(c_not @ $false|X426)|X426)))&(((((~X426|X426|(~X426|c_not @ $true)|X426)&(~c_not @ $false|X426|(~X426|c_not @ $true)|X426))&((~X426|~c_not @ $true|(~X426|c_not @ $true)|X426)&(~c_not @ $false|~c_not @ $true|(~X426|c_not @ $true)|X426)))&(~c_not @ $false|(~X426|c_not @ $true)|X426))&((((~X426|X426|(c_not @ $false|c_not @ $true)|X426)&(~c_not @ $false|X426|(c_not @ $false|c_not @ $true)|X426))&((~X426|~c_not @ $true|(c_not @ $false|c_not @ $true)|X426)&(~c_not @ $false|~c_not @ $true|(c_not @ $false|c_not @ $true)|X426)))&(~c_not @ $false|(c_not @ $false|c_not @ $true)|X426))))&((((~X426|X426|~c_not @ $true|X426)&(~c_not @ $false|X426|~c_not @ $true|X426))&((~X426|~c_not @ $true|~c_not @ $true|X426)&(~c_not @ $false|~c_not @ $true|~c_not @ $true|X426)))&(~c_not @ $false|~c_not @ $true|X426))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
0.46/0.69	thf(c_0_10, plain, ![X544:$o]:((~c_not @ X544|(~X544|c_False))&((X544|c_not @ X544)&(~c_False|c_not @ X544))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
0.46/0.69	thf(c_0_11, negated_conjecture, ~(![X1:$i]:(c_In @ X1 @ c_Empty=>![X2:$i]:(c_In @ X2 @ X1=>![X3:$i]:(c_In @ X3 @ X2=>?[X110:$i]:![X6:$i]:((c_ordinal @ X110=>epred113_2 @ X6 @ X110)=>(((c_ordinal @ X110=>c_exactly2 @ X110)=>(c_atleast2 @ X110=>(((((~c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty))|c_not @ $true)&(c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty))|c_not @ $false))=>(X110)=(X6))=>c_atleast3 @ X110)=>epred114_2 @ X6 @ X3)))=>c_nat_p @ X110)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[conj])])]), c_0_6]), c_0_7])).
0.46/0.69	thf(c_0_12, plain, ![X427:$i]:((~c_In @ X427 @ c_Empty|c_not @ $true)&(c_In @ esk20_0 @ c_Empty|c_not @ $false)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])).
0.46/0.69	thf(c_0_13, plain, (~c_not @ $false|~c_not @ $true), inference(eliminate_boolean_vars,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_9])])])).
0.46/0.69	thf(c_0_14, plain, c_not @ $false, inference(eliminate_boolean_vars,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_10])])])).
0.46/0.69	thf(c_0_15, negated_conjecture, ![X600:$i]:(c_In @ esk42_0 @ c_Empty&(c_In @ esk43_0 @ esk42_0&(c_In @ esk44_0 @ esk43_0&((~c_ordinal @ X600|epred113_2 @ (esk45_1 @ X600) @ X600)&((((((~c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty))|c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty))|(X600)=(esk45_1 @ X600)|epred114_2 @ (esk45_1 @ X600) @ esk44_0|~c_atleast2 @ X600|c_ordinal @ X600)&(~c_not @ $false|c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty))|(X600)=(esk45_1 @ X600)|epred114_2 @ (esk45_1 @ X600) @ esk44_0|~c_atleast2 @ X600|c_ordinal @ X600))&((~c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty))|~c_not @ $true|(X600)=(esk45_1 @ X600)|epred114_2 @ (esk45_1 @ X600) @ esk44_0|~c_atleast2 @ X600|c_ordinal @ X600)&(~c_not @ $false|~c_not @ $true|(X600)=(esk45_1 @ X600)|epred114_2 @ (esk45_1 @ X600) @ esk44_0|~c_atleast2 @ X600|c_ordinal @ X600)))&(~c_atleast3 @ X600|epred114_2 @ (esk45_1 @ X600) @ esk44_0|~c_atleast2 @ X600|c_ordinal @ X600))&((((~c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty))|c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty))|(X600)=(esk45_1 @ X600)|epred114_2 @ (esk45_1 @ X600) @ esk44_0|~c_atleast2 @ X600|~c_exactly2 @ X600)&(~c_not @ $false|c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty))|(X600)=(esk45_1 @ X600)|epred114_2 @ (esk45_1 @ X600) @ esk44_0|~c_atleast2 @ X600|~c_exactly2 @ X600))&((~c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty))|~c_not @ $true|(X600)=(esk45_1 @ X600)|epred114_2 @ (esk45_1 @ X600) @ esk44_0|~c_atleast2 @ X600|~c_exactly2 @ X600)&(~c_not @ $false|~c_not @ $true|(X600)=(esk45_1 @ X600)|epred114_2 @ (esk45_1 @ X600) @ esk44_0|~c_atleast2 @ X600|~c_exactly2 @ X600)))&(~c_atleast3 @ X600|epred114_2 @ (esk45_1 @ X600) @ esk44_0|~c_atleast2 @ X600|~c_exactly2 @ X600)))&~c_nat_p @ X600))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])).
0.46/0.69	thf(c_0_16, plain, ![X1:$i]:(c_not @ $true|~c_In @ X1 @ c_Empty), inference(split_conjunct,[status(thm)],[c_0_12])).
0.46/0.69	thf(c_0_17, plain, ~c_not @ $true, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14])])).
0.46/0.69	thf(c_0_18, negated_conjecture, c_In @ esk42_0 @ c_Empty, inference(split_conjunct,[status(thm)],[c_0_15])).
0.46/0.69	thf(c_0_19, plain, ![X1:$i]:~c_In @ X1 @ c_Empty, inference(sr,[status(thm)],[c_0_16, c_0_17])).
0.46/0.69	thf(c_0_20, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_18, c_0_19]), ['proof']).
0.46/0.69	# SZS output end CNFRefutation
0.46/0.69	# Proof object total steps             : 21
0.46/0.69	# Proof object clause steps            : 7
0.46/0.69	# Proof object formula steps           : 14
0.46/0.69	# Proof object conjectures             : 5
0.46/0.69	# Proof object clause conjectures      : 2
0.46/0.69	# Proof object formula conjectures     : 3
0.46/0.69	# Proof object initial clauses used    : 4
0.46/0.69	# Proof object initial formulas used   : 4
0.46/0.69	# Proof object generating inferences   : 0
0.46/0.69	# Proof object simplifying inferences  : 6
0.46/0.69	# Training examples: 0 positive, 0 negative
0.46/0.69	# Parsed axioms                        : 213
0.46/0.69	# Removed by relevancy pruning/SinE    : 0
0.46/0.69	# Initial clauses                      : 7366
0.46/0.69	# Removed in clause preprocessing      : 2354
0.46/0.69	# Initial clauses in saturation        : 5012
0.46/0.69	# Processed clauses                    : 25
0.46/0.69	# ...of these trivial                  : 1
0.46/0.69	# ...subsumed                          : 3
0.46/0.69	# ...remaining for further processing  : 21
0.46/0.69	# Other redundant clauses eliminated   : 0
0.46/0.69	# Clauses deleted for lack of memory   : 0
0.46/0.69	# Backward-subsumed                    : 0
0.46/0.69	# Backward-rewritten                   : 0
0.46/0.69	# Generated clauses                    : 1
0.46/0.69	# ...of the previous two non-trivial   : 0
0.46/0.69	# Contextual simplify-reflections      : 0
0.46/0.69	# Paramodulations                      : 0
0.46/0.69	# Factorizations                       : 0
0.46/0.69	# NegExts                              : 0
0.46/0.69	# Equation resolutions                 : 0
0.46/0.69	# Propositional unsat checks           : 0
0.46/0.69	#    Propositional check models        : 0
0.46/0.69	#    Propositional check unsatisfiable : 0
0.46/0.69	#    Propositional clauses             : 0
0.46/0.69	#    Propositional clauses after purity: 0
0.46/0.69	#    Propositional unsat core size     : 0
0.46/0.69	#    Propositional preprocessing time  : 0.000
0.46/0.69	#    Propositional encoding time       : 0.000
0.46/0.69	#    Propositional solver time         : 0.000
0.46/0.69	#    Success case prop preproc time    : 0.000
0.46/0.69	#    Success case prop encoding time   : 0.000
0.46/0.69	#    Success case prop solver time     : 0.000
0.46/0.69	# Current number of processed clauses  : 20
0.46/0.69	#    Positive orientable unit clauses  : 6
0.46/0.69	#    Positive unorientable unit clauses: 0
0.46/0.69	#    Negative unit clauses             : 10
0.46/0.69	#    Non-unit-clauses                  : 4
0.46/0.69	# Current number of unprocessed clauses: 4987
0.46/0.69	# ...number of literals in the above   : 25551
0.46/0.69	# Current number of archived formulas  : 0
0.46/0.69	# Current number of archived clauses   : 1
0.46/0.69	# Clause-clause subsumption calls (NU) : 3
0.46/0.69	# Rec. Clause-clause subsumption calls : 3
0.46/0.69	# Non-unit clause-clause subsumptions  : 0
0.46/0.69	# Unit Clause-clause subsumption calls : 6
0.46/0.69	# Rewrite failures with RHS unbound    : 0
0.46/0.69	# BW rewrite match attempts            : 0
0.46/0.69	# BW rewrite match successes           : 0
0.46/0.69	# Condensation attempts                : 0
0.46/0.69	# Condensation successes               : 0
0.46/0.69	# Termbank termtop insertions          : 516655
0.46/0.69	
0.46/0.69	# -------------------------------------------------
0.46/0.69	# User time                : 0.288 s
0.46/0.69	# System time              : 0.024 s
0.46/0.69	# Total time               : 0.312 s
0.46/0.69	# Maximum resident set size: 2008 pages
0.46/0.69	EOF